An average distance result in Euclidean n-space

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Group average representations in Euclidean distance cones

The set of Euclidean distance matrices has a well-known representation as a convex cone. The problems of representing the group averages of K distance matrices are discussed, but not fully resolved, in the context of SMACOF, Generalized Orthogonal Procrustes Analysis and Individual Differences Scaling. The polar (or dual) cone representation, corresponding to inner-products around a centroid, i...

متن کامل

A Combinatorial Result About Points and Balls in Euclidean Space

A theorem of Neumann-Lara and Urrutia [3] is generalized from the plane to arbitrary n-dimensional Euclidean space R n , solving Problem 2 of [3]. By an n-ball we mean a set of the form { Theorem 1. For each n ≥ 1 there is c n > 0 such that for any finite set X Õ R n there is A Õ X, |A| ≤ 1/ 2 (n+3) , having the following property: if B ⊇ A is an n-ball, then |B « X| ≥ c n |X|. This theorem is ...

متن کامل

An adaptive image Euclidean distance

Article history: Received 13 October 2007 Received in revised form 12 June 2008 Accepted 31 July 2008

متن کامل

An Efficient Euclidean Distance Transform

Within image analysis the distance transform has many applications. The distance transform measures the distance of each object point from the nearest boundary. For ease of computation, a commonly used approximate algorithm is the chamfer distance transform. This paper presents an efficient linear-time algorithm for calculating the true Euclidean distance-squared of each point from the nearest ...

متن کامل

The Density of Sets Avoiding Distance 1 in Euclidean Space

We improve by an exponential factor the best known asymptotic upper bound for the density of sets avoiding 1 in Euclidean space. This result is obtained by a combination of an analytic bound that is an analogue of Lovász theta number and of a combinatorial argument involving finite subgraphs of the unit distance graph. In turn, we straightforwardly obtain an asymptotic improvement for the measu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Australian Mathematical Society

سال: 1982

ISSN: 0004-9727,1755-1633

DOI: 10.1017/s0004972700005815